A Formal Proof of Correctness of a Distributed Presentation Software System
نویسندگان
چکیده
In this paper we present a formal proof of total correctness for Infosoft e-Detailing 1.0 distributed presentation software using Isabelle proof assistant. We model execution of a distributed software as a transition system with a global state that is composed of states of the system’s components and show that under a certain progress assumption, after a presenter switches the current slide to a given target slide, the executions of this transition system reaches a state which all viewers (clients) can see the target slide.
منابع مشابه
The Correctness of the Fast Fourier Transform: A Structured Proof in ACL2
The powerlists data structure, created by Misra in the early 90s, is well suited to express recursive, data-parallel algorithms. Misra has shown how powerlists can be used to give simple descriptions to very complex algorithms, such as the Fast Fourier Transform (FFT). Such simplicity in presentation facilitates reasoning about the resulting algorithms, and in fact Misra has presented a stunnin...
متن کاملRevisiting the Paxos Algorithm
The PAXOS algorithm is an efficient and highly fault-tolerant algorithm, devised by Lamport, for reaching consensus in a distributed system. Although it appears to be practical, it seems to be not widely known or understood. This thesis contains a new presentation of the PAXOS algorithm, based on a formal decomposition into several interacting components. It also contains a correctness proof an...
متن کاملRevisiting the Paxos Algorithm Revisiting the Paxos Algorithm
The paxos algorithm is an e cient and highly fault-tolerant algorithm, devised by Lamport, for reaching consensus in a distributed system. Although it appears to be practical, it seems to be not widely known or understood. This thesis contains a new presentation of the paxos algorithm, based on a formal decomposition into several interacting components. It also contains a correctness proof and ...
متن کاملParallel prefix polymorphism permits parallelization, presentation & proof
Polymorphism in programming languages enables code reuse. Here, we show that polymorphism has broad applicability far beyond computations for technical computing: parallelism in distributed computing, presentation of visualizations of runtime data flow, and proofs for formal verification of correctness. The ability to reuse a single codebase for all these purposes provides new ways to understan...
متن کاملA Formalization of Software Architecture
Software architecture addresses the high level specification, design and analysis of software systems. Formal models can provide essential underpinning for architectural description languages (ADLs), and formal techniques can play an important role in analysis. While formal models and formal analysis may always enhance conventional notations and methods, they are of greatest benefit when they e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017